Upper Bound Constructions for Untangling Planar Geometric Graphs
نویسندگان
چکیده
For every n ∈ N, there is a straight-line drawing Dn of a planar graph on n vertices such that in any crossing-free straight-line drawing of the graph, at most O(n) vertices lie at the same position as in Dn. This improves on an earlier bound of O( √ n) by Goaoc et al. [6].
منابع مشابه
A Polynomial Bound for Untangling Geometric Planar Graphs
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keeping at least n vertices fixed. We answer this question in the affirmative with ǫ = 1/4. The previous best known bound was Ω( √ logn/ log logn). We also con...
متن کاملUntangling polygons and graphs
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph Cn while keeping at least Ω(n 2/3) vertices fixed. For any graph G, we also present an upper bound on the number of fixed vertices in the worst case. The bound is a function of t...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملPlanar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
We investigate the problem of constructing planar straight-line drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straight-line drawings, deened as the smallest angle formed by two incident edges. We prove the rst nontrivial upper bound on the angular resolution of planar straight-line drawings, and show a continuous trade-oo between the a...
متن کاملCodes on Planar Graphs
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several intriguing problems in the intersection of coding theory and graph theory. In this paper, we study codes defined by planar Tanner graphs. We derive an upper bound on...
متن کامل